本文介绍了使用C++编程解决迷宫问题的方法，通过BFS（广度优先搜索）寻找从起点到终点的最短步数。迷宫由不同字符表示，包括走不通的岩石和岩浆，以及道路、起点和终点。当找到从'S'到'E'的路径时，输出最少步数；若无路径可达，则输出-1。
也不确定是不是BFS，下面是题目，最后是解析，小白程序员，不喜勿喷。
Description:
You are provided a maze(迷宫), and you need to program to find the least steps to walk from the start to the end.And you can only walk in four directions:up, down,left, right.
There will only be 5 kinds of characters in the maze.The meaning of each is as followed.
"#" is for rock, which you can not walk through.
"S" is for start.
"E" is for end.
"." is for road.
"!" is for magma(岩浆),which you can not walk through.
Input
最低0.47元/天 解锁文章
扫一扫
1401
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
